Transitive Hall sets
نویسندگان
چکیده
We give the definition of Lazard and Hall sets in the context of transitive factorizations of free monoids. The equivalence of the two properties is proved. This allows to build new effective bases of free partially commutative Lie algebras. The commutation graphs for which such sets exist are completely characterized and we explicit, in this context, the classical PBW rewriting process.
منابع مشابه
On transitive soft sets over semihypergroups
The aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $S_{H}$ and $T_{H},$ respectively. It is shown that $T_{H}=S_{H}$ if and only if $beta=beta^{*}.$ We also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.
متن کاملSharply $(n-2)$-transitive Sets of Permutations
Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...
متن کاملul 2 00 5 Transitive Hall sets
We give the definition of Lazard and Hall sets in the context of transitive factorizations of free monoids. The equivalence of the two properties is proved. This allows to build new effective bases of free partially commutative Lie algebras. The commutation graphs for which such sets exist are completely characterized and we explicit, in this context, the classical PBW rewriting process.
متن کاملFuzzy number-valued fuzzy relation
It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...
متن کاملPermutation Models and SVC
Let M be a model of ZFAC (ZFC modified to allow a set of atoms), and let N be an inner model with the same set of atoms and the same pure sets (sets with no atoms in their transitive closure) as M . We show that N is a permutation submodel of M if and only if N satisfies the principle SVC (Small Violations of Choice), a weak form of the axiom of choice which says that in some sense, all violati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/math/0507032 شماره
صفحات -
تاریخ انتشار 2005